On guarding real terrains: The terrain guarding and the blocking path problems
نویسندگان
چکیده
Locating a minimum number of guards on terrain such that every point the is guarded by at least one known as Terrain Guarding Problem (TGP). In this paper, realistic example guarding problem studied, involving surveillance rugged geographical means thermal cameras. A issues related to TGP are addressed with integer-programming models proposed solve problem. Also, sensitivity analysis carried out in which five fictitious terrains created see effect resolution terrain, and characteristics, coverage optimization required guards. Finally, new problem, called Blocking Path (BPP), introduced. BPP about path blocks all possible infiltration routes. discussion provided relation Network Interdiction (NIP), has been studied extensively operations research community, k-Barrier Coverage Problem, under Sensor Deployment Problem. solved via an formulation based network paradigm.
منابع مشابه
The Complexity of Guarding Terrains
A set G of points on a 1.5-dimensional terrain, also known as an x-monotone polygonal chain, is said to guard the terrain if any point on the terrain is seen by a point in G. Two points on the terrain see each other if and only if the line segment between them is never strictly below the terrain. The minimum terrain guarding problem asks for a minimum guarding set for the given input terrain. W...
متن کاملGuarding Galleries and Terrains
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P . In this paper we present efficient approximation algorithms for finding the smallest set G of points of P so that each point of P is seen by at least one point of G, and the points of G are constrained to be belong to the set of vertices of an arbit...
متن کاملGuarding Orthogonal Terrains
A 1.5-dimensional terrain T with n vertices is an xmonotone polygonal chain in the plane. A point guard p on T guards a point q of T if the line segment connecting p to q lies on or above T ; p is a vertex guard if it is a vertex of T . In the Optimal Terrain Guarding (OTG) problem on T , the objective is to guard the vertices of T by the minimum number of vertex guards. King and Krohn [9] show...
متن کاملGuarding Polyhedral Terrains
We prove that [n/2J vertex guards are always sufficient and sometimes necessary to guard the surface of an n-vertex polyhedral terrain. We also show that l(4n 4)/13J edge guards are sometimes necessary to guard the surface of an n-vertex polyhedral terrain. The upper bound on the number of edge guards is ln/3J (Everett and Rivera-Campo, 1994). Since both upper bounds are based on the four color...
متن کاملGuarding Terrains via Local Search
We obtain a polynomial time approximation scheme for the 1.5D terrain guarding problem, improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled [3] and Mustafa and Ray [18]. Our key contribution is to show the existence of a planar graph that appropriately relates the local and global optimum.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2021
ISSN: ['1873-5274', '0305-0483']
DOI: https://doi.org/10.1016/j.omega.2020.102303